Combining Philosophers

All the ideas for Eubulides, M Loux / D Zimmerman and Leslie H. Tharp

expand these ideas     |    start again     |     specify just one area for these philosophers


20 ideas

1. Philosophy / E. Nature of Metaphysics / 6. Metaphysics as Conceptual
Modern empirical metaphysics focuses on ontological commitments of discourse, or on presuppositions [Loux/Zimmerman]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
The axiom of choice now seems acceptable and obvious (if it is meaningful) [Tharp]
5. Theory of Logic / A. Overview of Logic / 1. Overview of Logic
Logic is either for demonstration, or for characterizing structures [Tharp]
5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic
Elementary logic is complete, but cannot capture mathematics [Tharp]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order logic isn't provable, but will express set-theory and classic problems [Tharp]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / b. Basic connectives
In sentential logic there is a simple proof that all truth functions can be reduced to 'not' and 'and' [Tharp]
5. Theory of Logic / G. Quantification / 2. Domain of Quantification
The main quantifiers extend 'and' and 'or' to infinite domains [Tharp]
5. Theory of Logic / G. Quantification / 7. Unorthodox Quantification
There are at least five unorthodox quantifiers that could be used [Tharp]
5. Theory of Logic / J. Model Theory in Logic / 3. Löwenheim-Skolem Theorems
The Löwenheim-Skolem property is a limitation (e.g. can't say there are uncountably many reals) [Tharp]
Skolem mistakenly inferred that Cantor's conceptions were illusory [Tharp]
5. Theory of Logic / K. Features of Logics / 3. Soundness
Soundness would seem to be an essential requirement of a proof procedure [Tharp]
5. Theory of Logic / K. Features of Logics / 4. Completeness
Completeness and compactness together give axiomatizability [Tharp]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
If completeness fails there is no algorithm to list the valid formulas [Tharp]
5. Theory of Logic / K. Features of Logics / 6. Compactness
Compactness is important for major theories which have infinitely many axioms [Tharp]
Compactness blocks infinite expansion, and admits non-standard models [Tharp]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
A complete logic has an effective enumeration of the valid formulas [Tharp]
Effective enumeration might be proved but not specified, so it won't guarantee knowledge [Tharp]
5. Theory of Logic / L. Paradox / 1. Paradox
If you know your father, but don't recognise your father veiled, you know and don't know the same person [Eubulides, by Dancy,R]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / a. The Liar paradox
If you say truly that you are lying, you are lying [Eubulides, by Dancy,R]
5. Theory of Logic / L. Paradox / 6. Paradoxes in Language / b. The Heap paradox ('Sorites')
Removing one grain doesn't destroy a heap, so a heap can't be destroyed [Eubulides, by Dancy,R]